Color matching method, color regulation method, and color regulation system for automatically implementing maximum brightness of colored light

ABSTRACT

A color matching method, color regulation method, and color regulation system for automatically implementing the maximum brightness of a colored light, using a color matching algorithm for the maximum brightness so that a brightness formula for each primary color when the colored light implements a certain color coordinate point within the color gamut space can be efficiently and accurately calculated, and the brightness of the colored light reaches a maximum value after the color matching. The brightness formulae for commonly used target colors within the color gamut space of the colored light is calculated by means of the color matching algorithm for the maximum brightness, and these formulae are stored in a control unit of a light.

CROSS REFERENCE TO RELATED APPLICATIONS

The present application is a continuation of International Application No. PCT/CN2019/115410, filed on Nov. 4, 2019, which claims priority from Chinese Patent Application No. 201811301693.2 filed on Nov. 2, 2018, all of which are hereby incorporated herein by reference.

TECHNICAL FIELD

The present invention relates to the technical field of illumination with a colored light, and in particular to a color matching method, color regulation method, and color regulation system for automatically implementing the maximum brightness of a colored light.

BACKGROUND ART

With the continuous development of science and technology and the increasingly colorful human living environment, people's demands for lighting and lighting colors are increasing. Like in daily life, work, entertainment, celebrations, performances, banquets, parties and other occasions, people need more diverse and colorful environments. In order to satisfy the diverse demands of people, colored lights and technologies thereof continuously develop. A common colored light is achieved by mixing three colors: red, green, and blue. The three primary colors RGB are mixed in different proportions and intensity to produce various colors. In addition, there are more colored lights with primary colors, such as RGBW.

When light regulation and color mixing are performed on a traditional colored light, light regulation personnel adjust the brightness ratio of RGBW by pushing four faders on a control console that correspond to RGBW channels, so as to obtain the desired colors through mixing. Disadvantages of such a color mixing method are apparent, which require the light regulation personnel to have rich experiences in color matching and keen color discrimination abilities. For example, when an effect of 3000 K color temperature needs to be achieved through mixing in a certain scene, the light regulation personnel need keen color discrimination abilities to discriminate the 3000 K color temperature, and further need experiences and trials to adjust the brightness ratio of RGBW. But when it is required to accurately obtain a color in a certain scene through mixing, such as the color with color coordinates (0.3804, 0.3767), it is difficult to achieve even if the light dimming personnel use an instrument to perform measurement while performing regulation. The method for implementing color mixing through manually adjustment of the brightness ratio of various primary colors is inefficient and inaccurate.

In addition, the color mixing effect obtained through matching performed by the light regulation personnel based on the experiences only satisfies the color effect, but the maximum brightness is not obtained, and the brightness resources of the colored light cannot be utilized to the utmost extent.

SUMMARY

In order to overcome at least one of the deficiencies (drawbacks) described above in the prior art, the present invention provides a color matching method, color regulation method, and color regulation system for automatically implementing the maximum brightness of a colored light, so that it can efficiently and accurately calculate the brightness formula of each primary color when the colored light implements a certain color coordinate point within a color gamut space and a brightness priority strategy is adopted to ensure that the brightness resources of the colored light is utilized to the utmost extent after the color mixing of the colored light.

The following technical solutions are used to achieve the objective of the present invention:

According to one aspect, a color matching method for automatically implementing the maximum brightness of a colored light is provided, which comprises:

collecting brightness values and color coordinate values of various primary colors of a colored light; and

establishing a linear programming model according to a target color mixture K_(t) and the brightness values and the color coordinate values of the various primary colors of the colored light, and taking a maximum value of a brightness sum value L_(sum) of the various primary colors of the colored light as a target to solve the linear programming model, so as to obtain brightness formula values for the various primary colors that correspond to the maximum value of the brightness sum value L_(sum).

Preferably, when the colored light has four primary colors, the color coordinates of the target color mixture K_(t) of the colored light are denoted as (x_(t), y_(t)), the brightness values of the four primary colors of the colored light are respectively denoted as L′_(r), L′_(g), L′_(b), and L′_(w), and the color coordinates of the four primary colors of the colored light are respectively denoted as (x_(r), y_(r)), (x_(g), y_(g)), (x_(b), y_(b)), and (x_(w), y_(w));

the linear programming model is the following formula: a target function: max L _(sum) =L′ _(r) +L′ _(g) +L′ _(b) +L′ _(w),

$s.t.\left\{ \begin{matrix} {0 \leq L_{r}^{\prime} \leq L_{r}} \\ {0 \leq L_{g}^{\prime} \leq L_{g}} \\ {0 \leq L_{b}^{\prime} \leq L_{b}} \\ {0 \leq L_{w}^{\prime} \leq L_{w}} \\ {{\frac{x_{t}}{y_{t}}\left( {L_{r}^{\prime} + L_{g}^{\prime} + L_{b}^{\prime} + L_{w}^{\prime}} \right)} = {{\frac{x_{r}}{y_{r}}L_{r}^{\prime}} + {\frac{x_{g}}{y_{g}}L_{g}^{\prime}} + {\frac{x_{b}}{y_{b}}L_{b}^{\prime}} + {\frac{x_{w}}{y_{w}}L_{w}^{\prime}}}} \\ {{\frac{1 - x_{t} - y_{t}}{y_{t}}\left( {L_{r}^{\prime} + L_{g}^{\prime} + L_{b}^{\prime} + L_{w}^{\prime}} \right)} = {{\frac{1 - x_{r} - y_{r}}{y_{r}}L_{r}^{\prime}} +}} \\ {{\frac{1 - x_{g} - y_{g}}{y_{g}}L_{g}^{\prime}} + {\frac{1 - x_{b} - y_{b}}{y_{b}}L_{b}^{\prime}} + {\frac{1 - x_{w} - y_{w}}{y_{w}}L_{w}^{\prime}}} \end{matrix} \right.$

where L_(r), L_(g), L_(b), and L_(w) are respectively the maximum brightness values of the four primary colors of the colored light; and

when the colored light has three primary colors, the color coordinates of the target color mixture K_(t) of the colored light are denoted as (x_(t), y_(t)), the brightness values of the four primary colors of the colored light are respectively denoted as L′_(r), L′_(g), and L′_(b), and the color coordinates of the three primary colors of the colored light are respectively denoted as (x_(r), y_(r)), (x_(g), y_(g)), and (x_(b), y_(b));

the linear programming model is the following formula: a target function: max L _(sum) =L′ _(r) +L′ _(g) +L′ _(b),

$s.t.\left\{ \begin{matrix} {0 \leq L_{r}^{\prime} \leq L_{r}} \\ {0 \leq L_{g}^{\prime} \leq L_{g}} \\ {0 \leq L_{b}^{\prime} \leq L_{b}} \\ {{\frac{x_{t}}{y_{t}}\left( {L_{r}^{\prime} + L_{g}^{\prime} + L_{b}^{\prime}} \right)} = {{\frac{x_{r}}{y_{r}}L_{r}^{\prime}} + {\frac{x_{g}}{y_{g}}L_{g}^{\prime}} + {\frac{x_{b}}{y_{b}}L_{b}^{\prime}}}} \\ {{\frac{1 - x_{t} - y_{t}}{y_{t}}\left( {L_{r}^{\prime} + L_{g}^{\prime} + L_{b}^{\prime}} \right)} = {{\frac{1 - x_{r} - y_{r}}{y_{r}}L_{r}^{\prime}} +}} \\ {{\frac{1 - x_{g} - y_{g}}{y_{g}}L_{g}^{\prime}} + {\frac{1 - x_{b} - y_{b}}{y_{b}}L_{b}^{\prime}}} \end{matrix} \right.$

where L_(r), L_(g), and L_(b) are respectively the maximum brightness values of the three primary colors of the colored light.

According to another aspect, a color regulation method for automatically implementing the maximum brightness of a colored light is further provided, which comprises:

a formula calculation step: calculating, according to a specified target color mixture K_(t) and brightness values and color coordinate values of the various primary colors of a colored light, brightness formula values for the various primary colors that correspond to the maximum value of a brightness sum value L_(sum) of the various primary colors of the colored light; and

a color mixture control step: converting the brightness formula values for the various primary colors into a control signal, and controlling a color mixture of the colored light according to the control signal.

Preferably, the formula calculation step specifically comprises: respectively calculating, according to specified n target color mixtures K_(t) and the brightness values and the color coordinate values of the various primary colors of the colored light, n groups of brightness formula values for the various primary colors that correspond to the maximum values of the brightness sum value L_(sum) of the various primary colors of the colored light in the case of the n target color mixtures K_(t), where n is a natural number; and

the color mixture control step specifically comprises: pre-storing the n groups of brightness formula values for the various primary colors, selecting one of the pre-stored groups of brightness formula values for the various primary colors, converting the selected brightness formula values for the various primary colors into a control signal, and controlling the color mixture of the colored light according to the control signal.

Preferably, the formula calculation step of calculating, according to a specified target color mixture K_(t) and brightness values and color coordinate values of the various primary colors of the colored light, brightness formula values for the various primary colors that correspond to the maximum value of a brightness sum value L_(sum) of the various primary colors of the colored light specifically comprises:

establishing a linear programming model according to the specified target color mixture K_(t) and the brightness values and the color coordinate values of the various primary colors of the colored light, and taking the maximum value of the brightness sum value L_(sum) of the various primary colors of the colored light as a target to solve the linear programming model, so as to obtain the brightness formula values for the various primary colors that correspond to the maximum value of the brightness sum value L_(sum);

when the colored light has four primary colors, the color coordinates of the target color mixture K_(t) of the colored light are denoted as (x_(t), y_(t)), the brightness values of the four primary colors of the colored light are respectively denoted as L′_(r), L′_(g), L′_(b), and L′_(w), and the color coordinates of the four primary colors of the colored light are respectively denoted as (x_(r), y_(r)), (x_(g), y_(g)), (x_(b), y_(b)), and (x_(w), y_(w));

the linear programming model is the following formula: a target function: max L _(sum) =L′ _(r) +L′ _(g) +L′ _(b) +L′ _(w),

$s.t.\left\{ \begin{matrix} {0 \leq L_{r}^{\prime} \leq L_{r}} \\ {0 \leq L_{g}^{\prime} \leq L_{g}} \\ {0 \leq L_{b}^{\prime} \leq L_{b}} \\ {0 \leq L_{w}^{\prime} \leq L_{w}} \\ {{\frac{x_{t}}{y_{t}}\left( {L_{r}^{\prime} + L_{g}^{\prime} + L_{b}^{\prime} + L_{w}^{\prime}} \right)} = {{\frac{x_{r}}{y_{r}}L_{r}^{\prime}} + {\frac{x_{g}}{y_{g}}L_{g}^{\prime}} + {\frac{x_{b}}{y_{b}}L_{b}^{\prime}} + {\frac{x_{w}}{y_{w}}L_{w}^{\prime}}}} \\ \begin{matrix} {{\frac{1 - x_{t} - y_{t}}{y_{t}}\left( {L_{r}^{\prime} + L_{g}^{\prime} + L_{b}^{\prime} + L_{w}^{\prime}} \right)} = {{\frac{1 - x_{r} - y_{r}}{y_{r}}L_{r}^{\prime}} +}} \\ {{\frac{1 - x_{g} - y_{g}}{y_{g}}L_{g}^{\prime}} + {\frac{1 - x_{b} - y_{b}}{y_{b}}L_{b}^{\prime}} + {\frac{1 - x_{w} - y_{w}}{y_{w}}L_{w}^{\prime}}} \end{matrix} \end{matrix} \right.$

where L_(r), L_(g), L_(b), and L_(w) are respectively the maximum brightness values of the four primary colors of the colored light; and

when the colored light has three primary colors, the color coordinates of the target color mixture K_(t) of the colored light are denoted as (x_(t), y_(t)), the brightness values of the three primary colors of the colored light are respectively denoted as L′_(r), L′_(g), and L′_(b), and the color coordinates of the three primary colors of the colored light are respectively denoted as (x_(r), y_(r)), (x_(g), y_(g)), and (x_(b), y_(b));

the linear programming model is the following formula: a target function: max L _(sum) =L′ _(r) +L′ _(g) +L′ _(b),

$s.t.\left\{ \begin{matrix} {0 \leq L_{r}^{\prime} \leq L_{r}} \\ {0 \leq L_{g}^{\prime} \leq L_{g}} \\ {0 \leq L_{b}^{\prime} \leq L_{b}} \\ {{\frac{x_{t}}{y_{t}}\left( {L_{r}^{\prime} + L_{g}^{\prime} + L_{b}^{\prime}} \right)} = {{\frac{x_{r}}{y_{r}}L_{r}^{\prime}} + {\frac{x_{g}}{y_{g}}L_{g}^{\prime}} + {\frac{x_{b}}{y_{b}}L_{b}^{\prime}}}} \\ \begin{matrix} {{\frac{1 - x_{t} - y_{t}}{y_{t}}\left( {L_{r}^{\prime} + L_{g}^{\prime} + L_{b}^{\prime}} \right)} = {{\frac{1 - x_{r} - y_{r}}{y_{r}}L_{r}^{\prime}} +}} \\ {{\frac{1 - x_{g} - y_{g}}{y_{g}}L_{g}^{\prime}} + {\frac{1 - x_{b} - y_{b}}{y_{b}}L_{b}^{\prime}}} \end{matrix} \end{matrix} \right.$

where L_(r), L_(g), and L_(b) are respectively the maximum brightness values of the three primary colors of the colored light.

Preferably, the color mixture control step of converting the brightness formula values for the various primary colors into a control signal of a control console of the colored light specifically comprises:

dividing the brightness of the controlled colored light into N brightness levels from dark to bright, and converting the brightness formula values for the various primary colors into signal data of the control console of the colored light according to the following formula:

${{Signal}{data}} = {\frac{{Brightness}{formula}{values}{for}{various}{primary}{colors}}{{Maximum}{brightness}{values}{of}{the}{various}{primary}{colors}} \times N}$

converting the signal data into a control signal based on the brightness level M of the currently controlled colored light according to the following formula, where

O≤M≤N:

${{Control}{signal}} = {{Signal}{data} \times \frac{M}{N}}$

According to still another aspect, a color regulation system for automatically implementing the maximum brightness of colored light is further provided, which comprises:

a color matching calculation unit configured to calculate, according to a specified target color mixture K_(t) and brightness values and color coordinate values of various primary colors of a colored light, brightness formula values for the various primary colors that correspond to a maximum value of a brightness sum value L_(sum) of the various primary colors of the colored light;

a signal conversion unit configured to convert the brightness formula values for the various primary colors into a control signal; and

a drive unit configured to control the color mixture of the colored light according to the control signal.

Preferably, the color matching calculation unit is specifically configured to:

respectively calculate, according to specified n target color mixtures K_(t) and the brightness values and the color coordinate values of the various primary colors of the colored light, n groups of brightness formula values for the various primary colors that correspond to the maximum values of the brightness sum value L_(sum) of the various primary colors of the colored light in the case of the n target color mixtures K_(t), where n is a natural number;

the system further comprises:

a color matching regulation channel configured to input a color index value i, where i=1, 2, . . . , and n; and

a control unit configured to pre-store the n groups of brightness formula values for the various primary colors, acquire the color index value i, and select the pre-stored i^(th) group of brightness formula values for the various primary colors; and

the signal conversion unit is specifically configured to:

convert the i^(th) group of brightness formula values for the various primary colors into a control signal.

Preferably, the color matching calculation unit is specifically configured to:

establish a linear programming model according to the specified target color mixture K_(t) and the brightness values and the color coordinate values of the various primary colors of the colored light, and take the maximum value of the brightness sum value L_(sum) of the various primary colors of the colored light as a target to solve the linear programming model, so as to obtain the brightness formula values for the various primary colors that correspond to the maximum value of the brightness sum value L_(sum);

when the colored light has four primary colors, the color coordinates of the target color mixture K_(t) of the colored light are denoted as (x_(t), y_(t)), the brightness values of the four primary colors of the colored light are respectively denoted as L′_(r), L′_(g), L′_(b), and L′_(w), and the color coordinates of the four primary colors of the colored light are respectively denoted as (x_(r), y_(r)), (x_(g), y_(g)), (x_(b), y_(b)), and (x_(w), y_(w));

the linear programming model is the following formula: a target function: max L _(sum) =L′ _(r) +L′ _(g) +L′ _(b) +L′ _(w),

$s.t.\left\{ \begin{matrix} {0 \leq L_{r}^{\prime} \leq L_{r}} \\ {0 \leq L_{g}^{\prime} \leq L_{g}} \\ {0 \leq L_{b}^{\prime} \leq L_{b}} \\ {0 \leq L_{w}^{\prime} \leq L_{w}} \\ {{\frac{x_{t}}{y_{t}}\left( {L_{r}^{\prime} + L_{g}^{\prime} + L_{b}^{\prime} + L_{w}^{\prime}} \right)} = {{\frac{x_{r}}{y_{r}}L_{r}^{\prime}} + {\frac{x_{g}}{y_{g}}L_{g}^{\prime}} + {\frac{x_{b}}{y_{b}}L_{b}^{\prime}} + {\frac{x_{w}}{y_{w}}L_{w}^{\prime}}}} \\ \begin{matrix} {{\frac{1 - x_{t} - y_{t}}{y_{t}}\left( {L_{r}^{\prime} + L_{g}^{\prime} + L_{b}^{\prime} + L_{w}^{\prime}} \right)} = {{\frac{1 - x_{r} - y_{r}}{y_{r}}L_{r}^{\prime}} +}} \\ {{\frac{1 - x_{g} - y_{g}}{y_{g}}L_{g}^{\prime}} + {\frac{1 - x_{b} - y_{b}}{y_{b}}L_{b}^{\prime}} + {\frac{1 - x_{w} - y_{w}}{y_{w}}L_{w}^{\prime}}} \end{matrix} \end{matrix} \right.$

where L_(r), L_(g), L_(b), and L_(w) are respectively the maximum brightness values of the four primary colors of the colored light; and

when the colored light has three primary colors, the color coordinates of the target color mixture K_(t) of the colored light are denoted as (x_(t), y_(t)), the brightness values of the four primary colors of the colored light are respectively denoted as L′_(r), L′_(g), and L′_(b), and the color coordinates of the three primary colors of the colored light are respectively denoted as (x_(r), y_(r)), (x_(g), y_(g)), and (x_(b), y_(b));

the linear programming model is the following formula: a target function: max L _(sum) =L′ _(r) +L′ _(g) +L′ _(b),

$s.t.\left\{ \begin{matrix} {0 \leq L_{r}^{\prime} \leq L_{r}} \\ {0 \leq L_{g}^{\prime} \leq L_{g}} \\ {0 \leq L_{b}^{\prime} \leq L_{b}} \\ {{\frac{x_{t}}{y_{t}}\left( {L_{r}^{\prime} + L_{g}^{\prime} + L_{b}^{\prime}} \right)} = {{\frac{x_{r}}{y_{r}}L_{r}^{\prime}} + {\frac{x_{g}}{y_{g}}L_{g}^{\prime}} + {\frac{x_{b}}{y_{b}}L_{b}^{\prime}}}} \\ \begin{matrix} {{\frac{1 - x_{t} - y_{t}}{y_{t}}\left( {L_{r}^{\prime} + L_{g}^{\prime} + L_{b}^{\prime}} \right)} = {{\frac{1 - x_{r} - y_{r}}{y_{r}}L_{r}^{\prime}} +}} \\ {{\frac{1 - x_{g} - y_{g}}{y_{g}}L_{g}^{\prime}} + {\frac{1 - x_{b} - y_{b}}{y_{b}}L_{b}^{\prime}}} \end{matrix} \end{matrix} \right.$

where L_(r), L_(g), and L_(b) are respectively the maximum brightness values of the three primary colors of the colored light.

Preferably, the system further comprises:

a brightness regulation channel configured to input the brightness level M of the currently controlled colored light; and

the signal conversion unit is specifically configured to:

divide the brightness of the controlled colored light into N levels from dark to bright, and convert the brightness formula values for the various primary colors into signal data of a control console of the colored light according to the following formula:

${{Signal}{data}} = {\frac{{Brightness}{formula}{values}{for}{various}{primary}{colors}}{{Maximum}{brightness}{values}{of}{the}{various}{primary}{colors}} \times N}$

convert the signal data into a control signal based on the brightness level M of the currently controlled colored light according to the following formula, where

O≤M≤N:

${{Control}{signal}} = {{Signal}{data} \times \frac{M}{N}}$

Compared with the prior art, the technical solutions of the present invention have the beneficial effects as follows:

(1) in the present invention, a color matching algorithm for the maximum brightness is used so that it can efficiently and accurately calculate the brightness formula of each primary color when the colored light implements a certain color coordinate point within a color gamut space, and in addition, the brightness of the colored light reaches a maximum value after the color matching, thereby fully utilizing the brightness resources of the colored light;

(2) in the present invention, the color matching algorithm for the maximum brightness is used to obtain optimal color matching schemes corresponding to multiple different color coordinates through matching, and the optimal color matching schemes are per-stored, and during use, corresponding faders on a control console are pushed to show color index values, so that it is convenient to invoke the pre-stored and matched optimal color matching schemes, and light regulation personnel can perform color matching faster and more accurately;

(3) in the present invention, during use, the corresponding faders on the control console may be pushed to show the control brightness level of a brightness regulation channel, so that the matched color brightness can be changed, and the light regulation personnel can linearly change the color brightness after the color matching without changing the color coordinates, thereby satisfying the brightness demands of different scenes; and

(4) in the present invention, a linear correction step is added so that when linear characteristics of a drive device and an LED light bead of the colored light are not good, the color brightness can also be linearly changed while the color coordinates remain unchanged.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a principle diagram of a system composition according to Embodiment 3 of the present invention.

FIG. 2 is another principle diagram of the system composition according to Embodiment 3 of the present invention.

DETAILED DESCRIPTION OF EMBODIMENTS

The accompanying drawings are merely for exemplary illustration and are not to be construed as limiting the present patent.

For better illustration of the embodiments, some components in the figures may be omitted, scaled up or scaled down, which does not represent the actual size of a product.

For those skilled in the art, it would have been appreciated that some well-known structures in the figures and the illustration thereof could be omitted.

In the description of the present invention, unless otherwise stated, “multiple” means two or more.

The technical solutions of the present invention are further described in conjunction with drawings and embodiments below.

Embodiment 1

This embodiment provides a color matching method for automatically implementing the maximum brightness of a colored light, which comprises the steps of:

obtaining brightness values and color coordinate values of various primary colors of a colored light; and

establishing a linear programming model according to a target color mixture K_(t), the brightness values and the color coordinate values of the various primary colors of the colored light, and taking a maximum value of a brightness sum value L_(sum) of the various primary colors of the colored light as a target to solve the linear programming model, so as to obtain brightness formula values for the various primary colors that correspond to the maximum value of the brightness sum value L_(sum).

When the colored light has four primary colors, the color coordinates of the target color mixture K_(t) of the colored light are set to (x_(t), y_(t)), the brightness values of the four primary colors of the colored light are respectively denoted as L′_(r), L′_(g), L′_(b), and L′_(w), and the color coordinates of the four primary colors of the colored light are respectively denoted as (x_(r), y_(r)), (x_(g), y_(g)), (x_(b), y_(b)), and (x_(w), y_(w));

the subscripts r, g, b, and w represent primary colors: red, green, blue, and white, and the subscript t represents a target color mixture; and

the linear programming model is the following formula: a target function: max L _(sum) =L′ _(r) +L′ _(g) +L′ _(b) +L′ _(w),

$s.t.\left\{ \begin{matrix} {0 \leq L_{r}^{\prime} \leq L_{r}} \\ {0 \leq L_{g}^{\prime} \leq L_{g}} \\ {0 \leq L_{b}^{\prime} \leq L_{b}} \\ {0 \leq L_{w}^{\prime} \leq L_{w}} \\ {{\frac{x_{t}}{y_{t}}\left( {L_{r}^{\prime} + L_{g}^{\prime} + L_{b}^{\prime} + L_{w}^{\prime}} \right)} = {{\frac{x_{r}}{y_{r}}L_{r}^{\prime}} + {\frac{x_{g}}{y_{g}}L_{g}^{\prime}} + {\frac{x_{b}}{y_{b}}L_{b}^{\prime}} + {\frac{x_{w}}{y_{w}}L_{w}^{\prime}}}} \\ \begin{matrix} {{\frac{1 - x_{t} - y_{t}}{y_{t}}\left( {L_{r}^{\prime} + L_{g}^{\prime} + L_{b}^{\prime} + L_{w}^{\prime}} \right)} = {{\frac{1 - x_{r} - y_{r}}{y_{r}}L_{r}^{\prime}} +}} \\ {{\frac{1 - x_{g} - y_{g}}{y_{g}}L_{g}^{\prime}} + {\frac{1 - x_{b} - y_{b}}{y_{b}}L_{b}^{\prime}} + {\frac{1 - x_{w} - y_{w}}{y_{w}}L_{w}^{\prime}}} \end{matrix} \end{matrix} \right.$

where L_(r), L_(g), L_(b), and L_(w) are respectively the maximum brightness values of the four primary colors of the colored light, and s.t. represents a constraint condition.

When the colored light has three primary colors, the color coordinates of the target color mixture K_(t) of the colored light are set to (x_(t), y_(t)), the brightness values of the four primary colors of the colored light are respectively denoted as L′_(r), L′_(g), and L′_(b), and the color coordinates of the three primary colors of the colored light are respectively denoted as (x_(r), y_(r)), (x_(g), y_(g)), and (x_(b), y_(b));

the subscripts r, g, and b represent primary colors: red, green, and blue, and the subscript t represents a target color mixture; and

the linear programming model is the following formula: a target function: max L _(sum) =L′ _(r) +L′ _(g) +L′ _(b),

$s.t.\left\{ \begin{matrix} {0 \leq L_{r}^{\prime} \leq L_{r}} \\ {0 \leq L_{g}^{\prime} \leq L_{g}} \\ {0 \leq L_{b}^{\prime} \leq L_{b}} \\ {{\frac{x_{t}}{y_{t}}\left( {L_{r}^{\prime} + L_{g}^{\prime} + L_{b}^{\prime}} \right)} = {{\frac{x_{r}}{y_{r}}L_{r}^{\prime}} + {\frac{x_{g}}{y_{g}}L_{g}^{\prime}} + {\frac{x_{b}}{y_{b}}L_{b}^{\prime}}}} \\ \begin{matrix} {{\frac{1 - x_{t} - y_{t}}{y_{t}}\left( {L_{r}^{\prime} + L_{g}^{\prime} + L_{b}^{\prime}} \right)} = {{\frac{1 - x_{r} - y_{r}}{y_{r}}L_{r}^{\prime}} +}} \\ {{\frac{1 - x_{g} - y_{g}}{y_{g}}L_{g}^{\prime}} + {\frac{1 - x_{b} - y_{b}}{y_{b}}L_{b}^{\prime}}} \end{matrix} \end{matrix} \right.$

where L_(r), L_(g), and L_(b) are respectively the maximum brightness values of the three primary colors of the colored light, and s.t. represents a constraint condition.

Taking the colored light having four primary colors as an example, the derivation process of the linear programming model is as follows:

Brightness parameters and chromaticity parameters of the various primary colors of the colored light are collected, and if the colored light has four primary colors, the maximum brightness values of the various primary colors are respectively denoted as L_(r), L_(g), L_(b), and L_(w), and the color coordinates of the various primary colors are respectively denoted as (x_(r), y_(r)), (x_(g), y_(g)), (x_(b), y_(b)), and (x_(w), y_(w)). The brightness value formulae for the various primary colors are supposed to be unknown numbers L′_(r), L′_(g), L′_(b), and L′_(w), and may enable the color coordinates of the color mixture to be equal to the color coordinates (x_(t), y_(t)) of the target color mixture K_(t), and enable the brightness of the color mixture to reach a maximum value.

A relation between the color coordinates x, y, and z according to a CIE XYZ 1931 chromaticity system and three stimulus values X, Y, and Z is as follows:

$\begin{matrix} {{x = \frac{X}{X + Y + Z}};{y = \frac{Y}{X + Y + Z}};{z = \frac{Z}{X + Y + Z}}} & (1) \end{matrix}$

x is divided by y and z is divided y in Formula (1) to derive:

$\begin{matrix} {{\frac{x}{Y} = \frac{X}{Y}};{\frac{z}{Y} = \frac{Z}{Y}}} & (2) \end{matrix}$

The relation between the color coordinates x, y, and z according to the CIE XYZ 1931 chromaticity system is x+y+z=1, the brightness L of a light source is equal to the value of Y among the three stimulus values X, Y, and Z of the light source (L=Y), and then the following formula may be derived in conjunction with Formula (2):

$\begin{matrix} {{X = {\frac{x}{y}L}};{Y = L};{Z = {\frac{1 - x - y}{y}L}}} & (3) \end{matrix}$

It may be seen that Formula (3) is a conversion relation between the three stimulus values X, Y, and Z and the color coordinates x, y, and z. In the case of red, the following is derived from Formula (3):

$\begin{matrix} \left\{ \begin{matrix} {X_{r} = {\frac{x_{r}}{y_{r}}L_{r}^{\prime}}} \\ {Y_{r} = L_{r}^{\prime}} \\ {Z_{r} = {\frac{1 - x_{r} - y_{r}}{y_{r}}L_{r}^{\prime}}} \end{matrix} \right. & (4) \end{matrix}$

Similarly, in the case of green, the following is derived from Formula (3):

$\begin{matrix} \left\{ \begin{matrix} {X_{g} = {\frac{x_{g}}{y_{g}}L_{g}^{\prime}}} \\ {Y_{g} = L_{g}^{\prime}} \\ {Z_{g} = {\frac{1 - x_{g} - y_{g}}{y_{g}}L_{g}^{\prime}}} \end{matrix} \right. & (5) \end{matrix}$

Similarly, in the case of blue, the following is derived from Formula (3):

$\begin{matrix} \left\{ \begin{matrix} {X_{b} = {\frac{x_{b}}{y_{b}}L_{b}^{\prime}}} \\ {Y_{b} = L_{b}^{\prime}} \\ {Z_{b} = {\frac{1 - x_{b} - y_{b}}{y_{b}}L_{b}^{\prime}}} \end{matrix} \right. & (6) \end{matrix}$

Similarly, in the case of white, the following is derived from Formula (3):

$\begin{matrix} \left\{ \begin{matrix} {X_{w} = {\frac{x_{w}}{y_{w}}L_{w}^{\prime}}} \\ {Y_{w} = L_{w}^{\prime}} \\ {Z_{w} = {\frac{1 - x_{w} - y_{w}}{y_{w}}L_{w}^{\prime}}} \end{matrix} \right. & (7) \end{matrix}$

Similarly, in the case of the target color mixture K_(t), the following is derived based on Formula (3) and additivity of brightness:

$\begin{matrix} \left\{ \begin{matrix} {X_{t} = {\frac{x_{t}}{y_{t}}\left( {L_{r}^{\prime} + L_{g}^{\prime} + L_{b}^{\prime} + L_{w}^{\prime}} \right)}} \\ {Y_{t} = {L_{r}^{\prime} + L_{g}^{\prime} + L_{b}^{\prime} + L_{w}^{\prime}}} \\ {Z_{t} = {\frac{1 - x_{t} - y_{t}}{y_{t}}\left( {L_{r}^{\prime} + L_{g}^{\prime} + L_{b}^{\prime} + L_{w}^{\prime}} \right)}} \end{matrix} \right. & (8) \end{matrix}$

In the case of the target color mixture K_(t), the following formula may be further derived through superposition calculation of the three stimulus values X, Y, and Z of the various primary colors:

$\begin{matrix} \left\{ \begin{matrix} {X_{t} = {X_{r} + X_{g} + X_{b} + X_{w}}} \\ {Y_{t} = {Y_{r} + Y_{g} + Y_{b} + Y_{w}}} \\ {Z_{t} = {Z_{r} + Z_{g} + Z_{b} + Z_{w}}} \end{matrix} \right. & (9) \end{matrix}$

Formula (10) may be derived by substituting Formulas (4) to (8) into Formula (9):

$\begin{matrix} \left\{ \begin{matrix} {{\frac{x_{t}}{y_{t}}\left( {L_{r}^{\prime} + L_{g}^{\prime} + L_{b}^{\prime} + L_{w}^{\prime}} \right)} = {{\frac{x_{r}}{y_{r}}L_{r}^{\prime}} + {\frac{x_{g}}{y_{g}}L_{g}^{\prime}} + {\frac{x_{b}}{y_{b}}L_{b}^{\prime}} + {\frac{x_{w}}{y_{w}}L_{w}^{\prime}}}} \\ {{L_{r}^{\prime} + L_{g} + L_{b}^{\prime} + L_{w}^{\prime}} = {L_{r}^{\prime} + L_{g}^{\prime} + L_{b}^{\prime} + L_{w}^{\prime}}} \\ {{\frac{1 - x_{t} - y_{t}}{y_{t}}\left( {L_{r}^{\prime} + L_{g}^{\prime} + L_{b}^{\prime} + L_{w}^{\prime}} \right)} = {{\frac{1 - x_{r} - y_{r}}{y_{r}}L_{r}^{\prime}} + {\frac{1 - x_{g} - y_{g}}{y_{g}}L_{g}^{\prime}} +}} \\ {{\frac{1 - x_{b} - y_{b}}{y_{b}}L_{b}^{\prime}} + {\frac{1 - x_{w} - y_{w}}{y_{w}}L_{w}^{\prime}}} \end{matrix} \right. & (10) \end{matrix}$

In this case, the following linear programming model is used to solve the unknown numbers, namely, the brightness values L′_(r), L′_(g), L′_(b), and L′_(w) of the various primary colors in Formula (10), the decision variables of the linear programming model are the unknown numbers, namely, the brightness values L′_(r), L′_(g), L′_(b), and L′_(w), the target function is maximizing the brightness sum value L_(sum)=L′_(r)+L′_(g)+L′_(b)+L′_(w), and the constraint condition is satisfying that the brightness formula value does not exceed the inherent maximum brightness value of each primary color of the colored light, and the color coordinates after the color mixing are (x_(t), y_(t)), that is, satisfying a colorimetry equation constraint, in other words, Expression (11) of the linear programming model can be derived: a target function: max L _(sum) =L′ _(r) +L′ _(g) +L′ _(b) +L′ _(w),

$\begin{matrix} {s.t.\left\{ \begin{matrix} {0 \leq L_{r}^{\prime} \leq L_{r}} \\ {0 \leq L_{g}^{\prime} \leq L_{g}} \\ {0 \leq L_{b}^{\prime} \leq L_{b}} \\ {0 \leq L_{w}^{\prime} \leq L_{w}} \\ {{\frac{x_{t}}{y_{t}}\left( {L_{r}^{\prime} + L_{g}^{\prime} + L_{b}^{\prime} + L_{w}^{\prime}} \right)} = {{\frac{x_{r}}{y_{r}}L_{r}^{\prime}} + {\frac{x_{g}}{y_{g}}L_{g}^{\prime}} + {\frac{x_{b}}{y_{b}}L_{b}^{\prime}} + {\frac{x_{w}}{y_{w}}L_{w}^{\prime}}}} \\ {{\frac{1 - x_{t} - y_{t}}{y_{t}}\left( {L_{r}^{\prime} + L_{g}^{\prime} + L_{b}^{\prime} + L_{w}^{\prime}} \right)} = {{\frac{1 - x_{r} - y_{r}}{y_{r}}L_{r}^{\prime}} +}} \\ {{\frac{1 - x_{g} - y_{g}}{y_{g}}L_{g}^{\prime}} + {\frac{1 - x_{b} - y_{b}}{y_{b}}L_{b}^{\prime}} + {\frac{1 - x_{w} - y_{w}}{y_{w}}L_{w}^{\prime}}} \end{matrix} \right.} & (11) \end{matrix}$

According to the derivation principle of the above linear programming model, the method may be further applied to colored lights having other numbers of primary colors, for example, a colored light having three primary colors.

By solving the linear programming model, the brightness formula for each primary color at this time can be sought from the known given color coordinates (x_(t), y_(t)) of the target color mixture K_(t), so that the color coordinates of the color mixture with this formula are equal to the target color coordinates (x_(t), y_(t)), and the brightness of the color mixture reaches a maximum value. Therefore, in the method, a color matching algorithm for the maximum brightness is utilized so that a brightness formula for each primary color when a colored light implements a certain color coordinate point within a color gamut space can be efficiently and accurately calculated, and the brightness of the colored light reaches a maximum value after the color matching, thereby fully utilizing the brightness resources of the colored light.

Embodiment 2

This embodiment provides a color regulation method for automatically implementing the maximum brightness of a colored light, which comprises:

a formula calculation step:

calculating, according to a specified target color mixture K_(t), and brightness values and color coordinate values of the various primary colors of the colored light, brightness formula values for the various primary colors that correspond to a maximum value of a brightness sum value L_(sum) of the various primary colors of the colored light; and

a color mixture control step:

converting the brightness formula values for the various primary colors into a control signal, and controlling a color mixture of the colored light according to the control signal.

In this embodiment, the formula calculation step specifically comprises:

respectively calculating, according to specified n target color mixtures K_(t) and the brightness values and the color coordinate values of the various primary colors of the colored light, n groups of brightness formula values for the various primary colors that correspond to the maximum values of the brightness sum value L_(sum) of the various primary colors of the colored light in the case of the n target color mixtures K_(t), where n is a natural number; and

the color mixture control step specifically comprises:

pre-storing the n groups of brightness formula values for the various primary colors, selecting one of the pre-stored groups of brightness formula values for the various primary colors, converting the selected brightness formula values for the various primary colors into a control signal, and controlling the color mixture of the colored light according to the control signal.

Different values within a color gamut space of the colored light are used for the target color mixtures K_(t) of the colored light, and the formula calculation step is repeatedly used, so as to obtain optimal brightness formulae corresponding to different target color mixtures K_(t), and these different brightness formulae may be pre-stored, so that it is convenient to invoke the pre-stored and matched optimal color matching schemes from the pre-stored brightness formulae, then the invoked brightness formulae are converted into a control signal of a control console of the colored light, and light regulation personnel regulate the color mixture of the colored light faster and more accurately.

In this embodiment, the formula calculation step of calculating, according to a specified target color mixture K_(t) and brightness values and color coordinate values of various primary colors of a colored light, brightness formula values for the various primary colors that correspond to a maximum value of a brightness sum value L_(sum) of the various primary colors of the colored light specifically comprises:

establishing a linear programming model according to the specified target color mixture K_(t) and the brightness values and the color coordinate values of the various primary colors of the colored light, and taking the maximum value of the brightness sum value L_(sum) of the various primary colors of the colored light as a target to solve the linear programming model, so as to obtain the brightness formula values for the various primary colors that correspond to the maximum value of the brightness sum value L_(sum);

when the colored light has four primary colors, the color coordinates of the target color mixture K_(t) of the colored light are denoted as (x_(t), y_(t)), the brightness values of the four primary colors of the colored light are respectively denoted as L′_(r), L′_(g), L′_(b), and L′_(w), and the color coordinates of the four primary colors of the colored light are respectively denoted as (x_(r), y_(r)), (x_(g), y_(g)), (x_(b), y_(b)), and (x_(w), y_(w));

the linear programming model is the following formula: a target function: max L _(sum) =L′ _(r) +L′ _(g) +L′ _(b) +L′ _(w),

$s.t.\left\{ \begin{matrix} {0 \leq L_{r}^{\prime} \leq L_{r}} \\ {0 \leq L_{g}^{\prime} \leq L_{g}} \\ {0 \leq L_{b}^{\prime} \leq L_{b}} \\ {0 \leq L_{w}^{\prime} \leq L_{w}} \\ {{\frac{x_{t}}{y_{t}}\left( {L_{r}^{\prime} + L_{g}^{\prime} + L_{b}^{\prime} + L_{w}^{\prime}} \right)} = {{\frac{x_{r}}{y_{r}}L_{r}^{\prime}} + {\frac{x_{g}}{y_{g}}L_{g}^{\prime}} + {\frac{x_{b}}{y_{b}}L_{b}^{\prime}} + {\frac{x_{w}}{y_{w}}L_{w}^{\prime}}}} \\ {{\frac{1 - x_{t} - y_{t}}{y_{t}}\left( {L_{r}^{\prime} + L_{g}^{\prime} + L_{b}^{\prime} + L_{w}^{\prime}} \right)} = {{\frac{1 - x_{r} - y_{r}}{y_{r}}L_{r}^{\prime}} +}} \\ {{\frac{1 - x_{g} - y_{g}}{y_{g}}L_{g}^{\prime}} + {\frac{1 - x_{b} - y_{b}}{y_{b}}L_{b}^{\prime}} + {\frac{1 - x_{w} - y_{w}}{y_{w}}L_{w}^{\prime}}} \end{matrix} \right.$

where L_(r), L_(g), L_(b), and L_(w) are respectively the brightness values of the four primary colors of the colored light; and

when the colored light has three primary colors, the color coordinates of the target color mixture K_(t) of the colored light are denoted as (x_(t), y_(t)), the brightness values of the three primary colors of the colored light are respectively denoted as L′_(r), L′_(g), and L′_(b), and the color coordinates of the three primary colors of the colored light are respectively denoted as (x_(r), y_(r)), (x_(g), y_(g)), and (x_(b), y_(b));

the linear programming model is the following formula: a target function: max L _(sum) =L′ _(r) +L′ _(g) +L′ _(b),

$s.t.\left\{ \begin{matrix} {0 \leq L_{r}^{\prime} \leq L_{r}} \\ {0 \leq L_{g}^{\prime} \leq L_{g}} \\ {0 \leq L_{b}^{\prime} \leq L_{b}} \\ {{\frac{x_{t}}{y_{t}}\left( {L_{r}^{\prime} + L_{g}^{\prime} + L_{b}^{\prime}} \right)} = {{\frac{x_{r}}{y_{r}}L_{r}^{\prime}} + {\frac{x_{g}}{y_{g}}L_{g}^{\prime}} + {\frac{x_{b}}{y_{b}}L_{b}^{\prime}}}} \\ {{\frac{1 - x_{t} - y_{t}}{y_{t}}\left( {L_{r}^{\prime} + L_{g}^{\prime} + L_{b}^{\prime}} \right)} = {{\frac{1 - x_{r} - y_{r}}{y_{r}}L_{r}^{\prime}} + {\frac{1 - x_{g} - y_{g}}{y_{g}}L_{g}^{\prime}} +}} \\ {\frac{1 - x_{b} - y_{b}}{y_{b}}L_{b}^{\prime}} \end{matrix} \right.$

where L_(r), L_(g), and L_(b) are respectively the maximum brightness values of the three primary colors of the colored light.

In this embodiment, the color mixture control step of converting the brightness formula values for the various primary colors into a control signal of a control console of the colored light specifically comprises:

dividing the brightness of the controlled colored light into N brightness levels from dark to bright, and converting the brightness formula values for the various primary colors into signal data of the control console of the colored light according to the following formula:

${{Signal}\mspace{14mu}{data}} = {\frac{{Brightness}\mspace{14mu}{formula}\mspace{14mu}{values}\mspace{14mu}{for}\mspace{14mu}{various}\mspace{14mu}{primary}\mspace{14mu}{colors}}{{Maximum}\mspace{14mu}{brightness}\mspace{14mu}{values}\mspace{14mu}{of}\mspace{14mu}{the}\mspace{14mu}{various}\mspace{14mu}{primary}\mspace{14mu}{colors}} \times N}$

converting the signal data into a control signal based on the brightness level M of the currently controlled colored light according to the following formula: 0≤M≤N

${{Control}\mspace{14mu}{signal}} = {{Signal}\mspace{14mu}{data} \times \frac{M}{N}}$

Taking the colored light having four primary colors as an example, the brightness formulae L′_(r), L′_(g), L′_(b), and L′_(w) for the various primary colors are converted into signal data R_(t), G_(t), B_(t), and W_(t) of the control console of the colored light according to Formula (12):

$\begin{matrix} {{R_{t} = {\frac{L_{r}^{\prime}}{L_{r}}N}};{G_{t} = {\frac{L_{g}^{\prime}}{L_{g}}N}};{B_{t} = {\frac{L_{b}^{\prime}}{L_{b}}N}};{W_{t} = {\frac{L_{w}^{\prime}}{L_{w}}N}}} & (12) \end{matrix}$

The signal data R_(t), G_(t), B_(t), and W_(t) is converted into a control signal bright based on the brightness level M of the currently controlled colored light according to Formula (13), where 0≤M≤N:

$\begin{matrix} {{bright}{= {\left( {R_{t}\ ,G_{t}\ ,B_{t}\ ,W_{t}} \right)\frac{M}{N}}}} & (13) \end{matrix}$

The brightness formulae L′_(r), L′_(g), L′_(b), and L′_(w) for the various primary colors that are solved from the linear programming model may be substituted into Formula (12), and then the signal data R_(t), G_(t), B_(t), and W_(t) that can be invoked by the control console of the colored light can be obtained through conversion.

To further control the brightness of the color, based on the brightness level M of the currently controlled colored light, the signal data R_(t), G_(t), B_(t), and W_(t) is substituted into Formula (13), and the brightness of the color is linearly changed through the control signal bright while the color coordinates thereof remain unchanged.

In a specific implementation process, the brightness of the colored light may be controlled, by means of DMX values of a brightness regulation channel of the control console of the colored light, to make 255-level linear changes, that is, the brightness of the colored light is divided into 255 levels from dark to bright, where M is a DMX value of the brightness regulation channel, and M may fall within 0 to 255. In this case, the signal data R_(t), G_(t), B_(t), and W_(t) can be converted into the control signal bright according to Formula (14):

$\begin{matrix} {{{bright}{= {\left( {R_{t},G_{t},B_{t},W_{t}} \right)\frac{M}{255}}}},\left( {M\mspace{14mu}{is}\mspace{14mu}{an}\mspace{14mu}{integer}\mspace{14mu}{{in}\mspace{14mu}\left\lbrack {0,255} \right\rbrack}} \right)} & (14) \end{matrix}$

In this embodiment, a linear correction step is further comprised. The linear correction step is added so that when linear characteristics of a drive device and an LED light bead of the colored light are not good, the color brightness can also be linearly changed while the color coordinates remain unchanged.

Embodiment 3

As shown in FIG. 1 , this embodiment provides a color regulation system for automatically implementing the maximum brightness of a colored light, which comprises:

a color matching calculation unit 10 configured to calculate and obtain, according to a specified target color mixture K_(t) and brightness values and color coordinate values of various primary colors of a colored light, brightness formula values for the various primary colors that correspond to a maximum value of a brightness sum value L_(sum) of the various primary colors of the colored light;

a signal conversion unit 20 configured to convert the brightness formula values for the various primary colors into a control signal; and

a drive unit 30 configured to control the color mixture of the colored light according to the control signal.

In a specific implementation process, the drive unit 30 is specifically configured to control the LED light bead 40 of the colored light according to the control signal.

In this embodiment, the system further comprises:

a brightness regulation channel 51 configured to input the brightness level M of the currently controlled colored light; and

the signal conversion unit 20 is specifically configured to:

divide the brightness of the controlled colored light into N levels from dark to bright, and convert the brightness formula values for the various primary colors into signal data of a control console of the colored light according to the following formula:

${{Signal}\mspace{14mu}{data}} = {\frac{{Brightness}\mspace{14mu}{formula}\mspace{14mu}{values}\mspace{14mu}{for}\mspace{14mu}{various}\mspace{14mu}{primary}\mspace{14mu}{colors}}{{Maximum}\mspace{14mu}{brightness}\mspace{14mu}{values}\mspace{14mu}{of}\mspace{14mu}{the}\mspace{14mu}{various}\mspace{14mu}{primary}\mspace{14mu}{colors}} \times N}$

convert the signal data into a control signal based on the brightness level M of the currently controlled colored light according to the following formula, where

0≤M≤N:

${{Control}\mspace{14mu}{signal}} = {{Signal}\mspace{14mu}{data} \times \frac{M}{N}}$

In a specific implementation process, the brightness of the colored light may be controlled, by means of DMX values of the brightness regulation channel 51 of the control console of the colored light, to make 255-level linear changes, that is, the brightness of the colored light is divided into 255 levels from dark to bright, where M is a DMX value of the brightness regulation channel 51, and M may fall within 0 to 255.

As shown in FIG. 2 , in this embodiment, the color matching calculation unit 10 is specifically configured to:

respectively calculate, according to specified n target color mixtures K_(t) and the brightness values and the color coordinate values of the various primary colors of the colored light, n groups of brightness formula values for the various primary colors that correspond to the maximum values of the brightness sum value L_(sum) of the various primary colors of the colored light in the case of the n target color mixtures K_(t), where n is a natural number;

the system further comprises:

a color matching regulation channel 52 configured to input a color index value i, where i=1, 2, . . . , and n; and

a control unit 60 configured to pre-store the n groups of brightness formula values for the various primary colors, acquire the color index value i, and select the pre-stored i^(th) group of brightness formula values for the various primary colors; and

the signal conversion unit 20 is specifically configured to:

convert the i^(th) group of brightness formula values for the various primary colors into a control signal.

In this embodiment, the color matching calculation unit 10 is specifically configured to:

establish a linear programming model according to the specified target color mixture K_(t) and the brightness values and the color coordinate values of the various primary colors of the colored light, and take the maximum value of the brightness sum value L_(sum) of the various primary colors of the colored light as a target to solve the linear programming model, so as to obtain the brightness formula values for the various primary colors that correspond to the maximum value of the brightness sum value L_(sum);

when the colored light has four primary colors, the color coordinates of the target color mixture K_(t) of the colored light are denoted as (x_(t), y_(t)), the brightness values of the four primary colors of the colored light are respectively denoted as L′_(r), L′_(g), L′_(b), and L′_(w), and the color coordinates of the four primary colors of the colored light are respectively denoted as (x_(r), y_(r)), (x_(g), y_(g)), (x_(b), y_(b)), and (x_(w), y_(w));

the linear programming model is the following formula: a target function: max L _(sum) =L′ _(r) +L′ _(g) +L′ _(b) +L′ _(w),

$s.t.\left\{ \begin{matrix} {0 \leq L_{r}^{\prime} \leq L_{t}} \\ {0 \leq L_{g}^{\prime} \leq L_{g}} \\ {0 \leq L_{b}^{\prime} \leq L_{b}} \\ {0 \leq L_{w}^{\prime} \leq L_{w}} \\ {{\frac{x_{t}}{y_{t}}\left( {L_{r}^{\prime} + L_{g}^{\prime 1} + L_{b}^{\prime} + L_{w}^{\prime}} \right)} = {{\frac{x_{r}}{y_{r}}L_{r}^{\prime}} + {\frac{x_{g}}{y_{g}}L_{g}^{\prime}} + {\frac{x_{b}}{y_{b}}L_{b}^{\prime}} + {\frac{x_{w}}{y_{w}}L_{w}^{\prime}}}} \\ {{\frac{1 - x_{t} - y_{t}}{y_{t}}\left( {L_{r}^{\prime} + L_{g}^{\prime} + L_{b}^{\prime} + L_{w}^{\prime}} \right)} = {{\frac{1 - x_{r} - y_{r}}{y_{r}}L_{r}^{\prime}} + {\frac{1 - x_{g} - y_{g}}{y_{g}}L_{g}^{\prime}} +}} \\ {{\frac{1 - x_{b} - y_{b}}{y_{b}}L_{b}^{\prime}} + {\frac{1 - x_{w} - y_{w}}{y_{w}}L_{w}^{\prime}}} \end{matrix} \right.$

where L_(r), L_(g), L_(b), and L_(w) are respectively the maximum brightness values of the four primary colors of the colored light; and

when the colored light has three primary colors, the color coordinates of the target color mixture K_(t) of the colored light are denoted as (x_(t), y_(t)), the brightness values of the four primary colors of the colored light are respectively denoted as L′_(r), L′_(g), and L′_(b), and the color coordinates of the three primary colors of the colored light are respectively denoted as (x_(r), y_(r)), (x_(g), y_(g)), and (x_(b), y_(b));

the linear programming model is the following formula: a target function: max L _(sum) =L′ _(r) +L′ _(g) +L′ _(b),

$s.t.\left\{ \begin{matrix} {0 \leq L_{r}^{\prime} \leq L_{r}} \\ {0 \leq L_{g}^{\prime} \leq L_{g}} \\ {0 \leq L_{b}^{\prime} \leq L_{b}} \\ {{\frac{x_{t}}{y_{t}}\left( {L_{r}^{\prime} + L_{g}^{\prime} + L_{b}^{\prime}} \right)} = {{\frac{x_{r}}{y_{r}}L_{r}^{\prime}} + {\frac{x_{g}}{y_{g}}L_{g}^{\prime}} + {\frac{x_{b}}{y_{b}}L_{b}^{\prime}}}} \\ {{\frac{1 - x_{t} - y_{t}}{y_{t}}\left( {L_{r}^{\prime} + L_{g}^{\prime} + L_{b}^{\prime}} \right)} = {{\frac{1 - x_{r} - y_{r}}{y_{r}}L_{r}^{\prime}} + {\frac{1 - x_{g} - y_{g}}{y_{g}}L_{g}^{\prime}} +}} \\ {\frac{1 - x_{b} - y_{b}}{y_{b}}L_{b}^{\prime}} \end{matrix} \right.$

where L_(r), L_(g), and L_(b) are respectively the maximum brightness values of the three primary colors of the colored light.

In a specific implementation process, the control unit 60 may alternatively be specifically configured to convert n groups of brightness formula values for the various primary colors into n groups of signal data, pre-store the n groups of signal data, acquires the color index value i, and select the pre-stored i^(th) group of signal data; and the signal conversion unit 20 may alternatively be specifically configured to convert the i^(th) group of signal data into a control signal.

The formula calculation step as described above is used multiple times, the brightness value formulae for commonly target colors (for example, multiple target color coordinates on a blackbody locus line) within a color gamut space of the colored light are calculated, and these brightness value formulae are stored in the control unit 60 of the colored light. As such, light regulation personnel can conveniently invoke a desired color mixing formula by regulating a DMX value of the color matching regulation channel 52 on the control console of the colored light, thereby automatically achieving one-key fast and accurate color mixing. In addition, the maximum brightness may be achieved after the color mixing, so that the brightness resources of the light can be utilized to the utmost extent. In the application after the color mixing, the light regulation personnel can also regulate the DMX values of the brightness regulation channel 51 on the control console of the colored light to enable the overall brightness of the color mixture to make 255-level linear changes, and the configured target color coordinates are not caused to change during the light regulation process so as to satisfy the demands of automatic, quick, and accurate color matching and light regulation for different chromaticities and different brightness in more scenes.

Taking a colored light having four primary colors as an example, a color regulation process for automatically implementing the maximum brightness by the colored light is specifically as follows: Brightness parameters and chromaticity parameters of the colored light are collected, and the maximum brightness values of the various primary colors of the colored light are respectively L_(r)=1160, L_(g)=2320, L_(b)=386, and L_(w)=2350, and the color coordinates of the various primary colors of the colored light are respectively (x_(r), y_(r))=(0.702, 0.297), (x_(g), y_(g))=(0.156, 0.717), (x_(b), y_(b))=(0.138, 0.045), and (x_(w), y_(w))=(0.398, 0.386). The color temperature of the target color mixture K_(t) is required to be 4545 K, and the color temperature falls on a point on the blackbody locus line. It is known that the target color coordinates of this point are (x_(t), y_(t))=(0.3591, 0.3624), and the color mixture obtained through matching is required to satisfy the brightness reaching a maximum value in addition to satisfying the target color coordinates.

The above known data is substituted into Formula (11), and Formula (15) is derived after simplification: a target function: max L _(sum) =L′ _(r) +L′ _(g) +L′ _(b) +L′ _(w),

$\begin{matrix} {s.t.\left\{ \begin{matrix} {0 \leq L_{r}^{\prime} \leq 1160} \\ {0 \leq L_{g}^{\prime} \leq 2320} \\ {0 \leq L_{b}^{\prime} \leq 386} \\ {0 \leq L_{w}^{\prime} \leq 2350} \\ {{0.\ 990894040\left( {L_{r}^{\prime} + L_{g}^{\prime} + L_{b}^{\prime} + L_{w}^{\prime}} \right)} = {{2.363636364L_{r}^{\prime}} +}} \\ {{0.217573222L_{g}^{\prime}} + {3.066666667L_{b}^{\prime}} + {1.031088083L_{w}^{\prime}}} \\ {{0.\ 768487859\left( {L_{r}^{\prime} + L_{g}^{\prime} + L_{b}^{\prime} + L_{w}^{\prime}} \right)} = {{0.003367003L_{r}^{\prime}} +}} \\ {{0.177126918L_{g}^{\prime}} + {1{8.1}5555556L_{b}^{\prime}} + {0.559585492L_{w}^{\prime}}} \end{matrix} \right.} & (15) \end{matrix}$

The brightness value formulae for the various primary colors are obtained by solving Formula (15): L′_(r)=1008.988, L′_(g)=2320, L′_(b)=151.5423, L′_(w)=2350

In this case, the brightness sum value reaches the maximum value L_(sum)=L′_(r)+L′_(g)+L′_(b)+L′_(w)=5830.531.

The calculated brightness value formulae for the various primary colors are converted into signal data R_(t), G_(t), B_(t), and W_(t) of the control console of the colored light, and when it is assumed that the control console of the colored light controls the brightness of the colored light, and the brightness being divided into N levels from the darkest to the brightest, where N=255, the signal data corresponding to the brightness value formulae for the various primary colors are converted as follows from Formula (16):

$\begin{matrix} {{{R_{t} = {{\frac{L_{r}^{\prime}}{L_{r}}N} = {{\frac{100{8.9}88}{22{1.8}035} \times 255} = {{22{1.8}035} \approx 222}}}};}{{G_{t} = {{\frac{L_{g}^{\prime}}{L_{g}}N} = {{\frac{2320}{2320} \times 255} = 255}}};}{{B_{t} = {{\frac{L_{b}^{\prime}}{L_{b}}N\frac{15{1.5}423}{386} \times 255} = {{10{0.1}121} \approx 100}}};}{{W_{t} = {{\frac{L_{w}^{\prime}}{L_{w}}N} = {{\frac{2350}{2350} \times 255} = 255}}};}} & (16) \end{matrix}$

It may be known from Formula (16) that the values of (R_(t), G_(t), B_(t), and W_(t)) in the signal data are (222, 255, 100, 255).

After the colored light implements the target color mixture, the brightness of the color may be further controlled by means of the brightness regulation channel 51, the maximum brightness sum value L_(sum)=5830.531 is divided into 256 parts (the DMX values of the brightness regulation channel 51 on the control console of the colored light are integers within 0 to 255), the signal data (222, 255, 100, 255) is regulated at levels of 0 to 255, and the expression (17) of the control signal bright is derived from Formula (13):

$\begin{matrix} {{{bright} = {\left( {222,255,100,255} \right)\frac{M}{255}}},\left( {M{is}{an}{integer}{{in}\left\lbrack {0,255} \right\rbrack}} \right)} & (17) \end{matrix}$

The signal data (222, 255, 100, 255) is regulated at levels of 0 to 255 on the brightness regulation channel 51 of the control console of the colored light, and the color brightness can be linearly changed while the color coordinates of the color mixture remain unchanged.

The obtained control signal bright may be directly used to control the color mixture of the colored light.

Alternatively, the signal data (222, 255, 100, 255) is first stored in a control unit chip of the light, and the storage position of the signal data (222, 255, 100, 255) is set to 1, then when the color matching regulation channel of the control console inputs the color index value 1, it indicates that the colored light needs to achieve the target color mixture at the storage position 1. In this case, the signal data (222, 255, 100, 255) is invoked and converted into the control signal bright to control the color mixture of the colored light.

Alternatively, the brightness formula values for the various primary colors may be first stored in the control unit chip of the light, and the storage position of the brightness formula values is set to 1, then when the color matching regulation channel 52 of the control console inputs the color index value 1, it indicates that the colored light needs to achieve the target color mixture at the storage position 1. In this case, the brightness formula values are invoked and converted into signal data, and the signal data is converted into a control signal to control the color mixture of the colored light.

Finally, the color mixture of the colored light is expressed as target color coordinates (x_(t), y_(t))=(0.3591, 0.3624), and the maximum brightness sum value L_(sum)=5830.531.

The coordinates of different points in the color gamut spaces of n colored lights are used for the color coordinates of the target color mixture K_(t), and the above process are repeated, so that the corresponding n groups of signal data R_(t), G_(t), B_(t), and W_(t) can be obtained. During application, when the color matching regulation channel 52 of the control console of the colored light inputs a DMX value, namely, a color index value i, where i=1, 2, . . . , and n, the i^(th) group of signal data R_(ti), G_(ti), B_(ti), and W_(ti) can be invoked to control the color mixture of colored light.

The same or similar reference numerals correspond to the same or similar components.

The position relationship described in the drawings are merely for exemplary illustration and are not to be construed as limiting the present patent.

Obviously, the above embodiments of the present invention are merely examples used for clearly describing the present invention, instead of limiting the implementations of the present invention. For those of ordinary skill in the art, other different forms of changes or variations could have also been made on the basis of the above-mentioned illustration. There is no need and no way to exhaustively list all implementations here. Within the spirit and principle of the present invention, any modifications, equivalent replacements, improvements, etc., shall be comprised within the scope of protection of the claims of the present invention. 

The invention claimed is:
 1. A color matching method for automatically implementing the maximum brightness of a colored light, comprising: collecting brightness values and color coordinate values of each primary color of the colored light; establishing a linear programming model according to a target color mixture K_(t), and the brightness values and the color coordinate values of each primary color of the colored light; and taking a maximum value of a brightness sum value L_(sum) of the primary colors of the colored light as a target function to solve the linear programming model to obtain brightness values for each primary color under the maximum value of the brightness sum value L_(sum), the obtained brightness values for each primary color refer to as brightness formula values for each primary color, the brightness sum value L_(sum) is a sum of the brightness values of each primary color, wherein when the colored light has m primary colors, the color coordinate values of the target color mixture K_(t) of the colored light are denoted as (x_(t), y_(t)), the brightness values of the m primary colors of the colored light are respectively denoted as L′₁, L′₂, . . . , L′_(m), and the color coordinate values of the m primary colors of the colored light are respectively denoted as (x₁, y₁), (x₂, y₂), . . . , and (x_(m), y_(m)); the linear programming model is the following formula: a target function: max L _(sum) =L′ ₁ +L′ ₂ +L′ _(m), $s.t.\left\{ \begin{matrix} {0 \leq L_{1}^{\prime} \leq L_{1}} \\ {0 \leq L_{1}^{\prime} \leq L_{2}} \\ {\ldots\ldots} \\ {0 \leq L_{m}^{\prime} \leq L_{m}} \\ {{\frac{x_{t}}{y_{t}}\left( {L_{1}^{\prime} + L_{2}^{\prime} + \ldots + L_{m}^{\prime}} \right)} = {{\frac{x_{1}}{y_{1}}L_{1}^{\prime}} + {\frac{x_{2}}{y_{2}}L_{2}^{\prime}} + \ldots + {\frac{x_{m}}{y_{m}}L_{m}^{\prime}}}} \\ \begin{matrix} {{\frac{1 - x_{t} - y_{t}}{y_{t}}\left( {L_{1}^{\prime} + L_{2}^{\prime} + \ldots + L_{m}^{\prime}} \right)} =} \\ {{\frac{1 - x_{1} - y_{1}}{y_{1}}L_{1}^{\prime}} + {\frac{1 - x_{2} - y_{2}}{y_{2}}L_{2}^{\prime}} + \ldots + {\frac{1 - x_{m} - y_{m}}{y_{m}}L_{m}^{\prime}}} \end{matrix} \end{matrix} \right.$ where m is an integer equal to or greater than 2, L₁, L₂, . . . , L_(m) are respectively the maximum brightness values of the m primary colors of the colored light, and s.t. represents a constraint condition for the color light with m primary colors.
 2. The color matching method for automatically implementing the maximum brightness of a colored light according to claim 1, wherein when the colored light has four primary colors, the color coordinate values of the target color mixture K_(t) of the colored light are denoted as (x_(t), y_(t)), the brightness values of the four primary colors of the colored light are respectively denoted as L′_(r), L′_(g), L′_(b), and L′_(w), and the color coordinate values of the four primary colors of the colored light are respectively denoted as (x_(r), y_(r)), (x_(g), y_(g)), (x_(b), y_(b)), and (x_(w), y_(w)); the linear programming model is the following formula: the target function is max L_(sum) L′ _(r) +L′ _(g) +L′ _(b) +L′ _(w), $s.t.\left\{ \begin{matrix} {0 \leq L_{r}^{\prime} \leq L_{r}} \\ {0 \leq L_{g}^{\prime} \leq L_{g}} \\ {0 \leq L_{b}^{\prime} \leq L_{b}} \\ {0 \leq L_{w}^{\prime} \leq L_{w}} \\ {{\frac{x_{t}}{y_{t}}\left( {L_{r}^{\prime} + L_{g}^{\prime} + L_{b}^{\prime} + L_{w}^{\prime}} \right)} = {{\frac{x_{r}}{y_{r}}L_{r}^{\prime}} + {\frac{x_{g}}{y_{g}}L_{g}^{\prime}} + {\frac{x_{b}}{y_{b}}L_{b}^{\prime}} + {\frac{x_{w}}{y_{w}}L_{w}^{\prime}}}} \\ {{\frac{1 - x_{t} - y_{t}}{y_{t}}\left( {L_{r}^{\prime} + L_{g}^{\prime} + L_{b}^{\prime} + L_{w}^{\prime}} \right)} = {{\frac{1 - x_{r} - y_{r}}{y_{r}}L_{r}^{\prime}} + {\frac{1 - x_{g} - y_{g}}{y_{g}}L_{g}^{\prime}} +}} \\ {{\frac{1 - x_{b} - y_{b}}{y_{b}}L_{b}^{\prime}} + {\frac{1 - x_{w} - y_{w}}{y_{w}}L_{w}^{\prime}}} \end{matrix} \right.$ where L_(r), L_(g), L_(b), and L_(w) are respectively the maximum brightness values of the four primary colors of the colored light, s.t. represents a constraint condition; and when the colored light has three primary colors, the color coordinates values of the target color mixture K_(t) of the colored light are denoted as (x_(t), y_(t)), the brightness values of the three primary colors of the colored light are respectively denoted as L′_(r), L′_(g), and L′_(b), and the color coordinate values of the three primary colors of the colored light are respectively denoted as (x_(r), y_(r)), (x_(g), y_(g)), and (x_(b), y_(b)); the linear programming model is the following formula: the target function is max L _(sum) =L′ _(r) +L′ _(g) +L′ _(b), $s.t.\left\{ \begin{matrix} {0 \leq L_{r}^{\prime} \leq L_{r}} \\ {0 \leq L_{g}^{\prime} \leq L_{g}} \\ {0 \leq L_{b}^{\prime} \leq L_{b}} \\ {{\frac{x_{t}}{y_{t}}\left( {L_{r}^{\prime} + L_{g}^{\prime} + L_{b}^{\prime}} \right)} = {{\frac{x_{r}}{y_{r}}L_{r}^{\prime}} + {\frac{x_{g}}{y_{g}}L_{g}^{\prime}} + {\frac{x_{b}}{y_{b}}L_{b}^{\prime}}}} \\ {{\frac{1 - x_{t} - y_{t}}{y_{t}}\left( {L_{r}^{\prime} + L_{g}^{\prime} + L_{b}^{\prime}} \right)} = {{\frac{1 - x_{r} - y_{r}}{y_{r}}L_{r}^{\prime}} + {\frac{1 - x_{g} - y_{g}}{y_{g}}L_{g}^{\prime}} +}} \\ {\frac{1 - x_{b} - y_{b}}{y_{b}}L_{b}^{\prime}} \end{matrix} \right.$ where L_(r), L_(g), and L_(b) are respectively the maximum brightness values of the three primary colors of the colored light, and s.t. represents a constraint condition.
 3. A color regulation method for automatically implementing the maximum brightness of a colored light, comprising a formula calculation step and a color mixture control step, the formula calculation step comprises: collecting brightness values and color coordinate values of each primary color of the colored light; establishing a linear programming model according to a target color mixture K_(t), and the brightness values and the color coordinate values of each primary color of the colored light; and taking a maximum value of a brightness sum value L_(sum) of the primary colors of the colored light as a target function to solve the linear programming model to obtain brightness values for each primary color under the maximum value of the brightness sum value L_(sum), the obtained brightness values for each primary color refer to as brightness formula values for each primary color, the brightness sum value L_(sum) is a sum of the brightness values of each primary color, wherein when the colored light has m primary colors, the color coordinate values of the target color mixture K_(t) of the colored light are denoted as (x_(t), y_(t)), the brightness values of the m primary colors of the colored light are respectively denoted as L′₁, L′₂, . . . , L′_(m), and the color coordinate values of the m primary colors of the colored light are respectively denoted as (x₁, y₁), (x₂, y₂), . . . , and (x_(m), y_(m)); the linear programming model is the following formula: the target function is max L _(sum) =L′ ₁ +L′ ₂ +. . . +L′ _(m), $s.t.\left\{ \begin{matrix} {0 \leq L_{1}^{\prime} \leq L_{1}} \\ {0 \leq L_{2}^{\prime} \leq L_{2}} \\ {\ldots\ldots} \\ {0 \leq L_{m}^{\prime} \leq L_{m}} \\ {{\frac{x_{t}}{y_{t}}\left( {L_{1}^{\prime} + L_{2}^{\prime} + \ldots + L_{m}^{\prime}} \right)} = {{\frac{x_{1}}{y_{1}}L_{1}^{\prime}} + {\frac{x_{2}}{y_{2}}L_{2}^{\prime}} + \ldots + {\frac{x_{m}}{y_{m}}L_{m}^{\prime}}}} \\ \begin{matrix} {{\frac{1 - x_{t} - y_{t}}{y_{t}}\left( {L_{1}^{\prime} + L_{2}^{\prime} + \ldots + L_{m}^{\prime}} \right)} =} \\ {{\frac{1 - x_{1} - y_{1}}{y_{1}}L_{1}^{\prime}} + {\frac{1 - x_{2} - y_{2}}{y_{2}}L_{2}^{\prime}} + \ldots + {\frac{1 - x_{m} - y_{m}}{y_{m}}L_{m}^{\prime}}} \end{matrix} \end{matrix} \right.$ where m is an integer equal to or greater than 2, L₁, L₂, . . . , L_(m) are respectively the maximum brightness values of the m primary colors of the colored light, and s.t. represents a constraint condition for the color light with m primary colors; and the color mixture control step comprises: converting the brightness formula values for each primary color into a control signal, and controlling a color mixture of the colored light according to the control signal.
 4. The color regulation method for automatically implementing the maximum brightness of a colored light according to claim 3, wherein the formula calculation step specifically comprises: respectively calculating, according to specified n target color mixtures K_(t) and the brightness values and the color coordinate values of each primary color of the colored light, n groups of brightness formula values for each primary color when the brightness sum value L_(sum) of the primary colors of the colored light has maximum value in each case of the n target color mixtures K_(t), where n is a natural number; and the color mixture control step comprises: pre-storing the n groups of brightness formula values for each primary color, selecting one of the pre-stored groups of brightness formula values, converting the selected brightness formula values into a control signal, and controlling the color mixture of the colored light according to the control signal.
 5. The color regulation method for automatically implementing the maximum brightness of a colored light according to claim 3, wherein when the colored light has four primary colors, the color coordinate values of the target color mixture K_(t) of the colored light are denoted as (x_(t), y_(t)), the brightness values of the four primary colors of the colored light are respectively denoted as L′_(r), L′_(g), L′_(b), and L′_(w), and the color coordinate values of the four primary colors of the colored light are respectively denoted as (x_(r), y_(r)), (x_(g), y_(g)), (x_(b), Y_(b)), and (x_(w), y_(w)); the linear programming model is the following formula: the target function is max L _(sum) =L′ _(r) +L′ _(g) +L′ _(b) +L′ _(w), $s.t.\left\{ \begin{matrix} {0 \leq L_{r}^{\prime} \leq L_{r}} \\ {0 \leq L_{g}^{\prime} \leq L_{g}} \\ {0 \leq L_{b}^{\prime} \leq L_{b}} \\ {0 \leq L_{w}^{\prime} \leq L_{w}} \\ {{\frac{x_{t}}{y_{t}}\left( {L_{r}^{\prime} + L_{g}^{\prime} + L_{b}^{\prime} + L_{w}^{\prime}} \right)} = {{\frac{x_{r}}{y_{r}}L_{r}^{\prime}} + {\frac{x_{g}}{y_{g}}L_{g}^{\prime}} + {\frac{x_{b}}{y_{b}}L_{b}^{\prime}} + {\frac{x_{w}}{y_{w}}L_{w}^{\prime}}}} \\ {{\frac{1 - x_{t} - y_{t}}{y_{t}}\left( {L_{r}^{\prime} + L_{g}^{\prime} + L_{b}^{\prime} + L_{w}^{\prime}} \right)} = {{\frac{1 - x_{r} - y_{r}}{y_{r}}L_{r}^{\prime}} + {\frac{1 - x_{g} - y_{g}}{y_{g}}L_{g}^{\prime}} +}} \\ {{\frac{1 - x_{b} - y_{b}}{y_{b}}L_{b}^{\prime}} + {\frac{1 - x_{w} - y_{w}}{y_{w}}L_{w}^{\prime}}} \end{matrix} \right.$ where L_(r), L_(g), L_(b), and L_(w), are respectively the maximum brightness values of the four primary colors of the colored light, and s.t. represents a constraint condition for the colored light with four primary colors; and when the colored light has three primary colors, the color coordinates values of the target color mixture K_(t) of the colored light are denoted as (x_(t), y_(t)), the brightness values of the three primary colors of the colored light are respectively denoted as L′_(r), L′_(g), and L′_(b), and the color coordinates values of the three primary colors of the colored light are respectively denoted as (x_(r), y_(r)), (x_(g), y_(g)), and (x_(b), y_(b)); the linear programming model is the following formula: the target function is max L _(sum) =L′ _(r) +L′ _(g) +L′ _(b), $s.t.\left\{ \begin{matrix} {0 \leq L_{r}^{\prime} \leq L_{r}} \\ {0 \leq L_{g}^{\prime} \leq L_{g}} \\ {0 \leq L_{b}^{\prime} \leq L_{b}} \\ {{\frac{x_{t}}{y_{t}}\left( {L_{r}^{\prime} + L_{g}^{\prime} + L_{b}^{\prime}} \right)} = {{\frac{x_{r}}{y_{r}}L_{r}^{\prime}} + {\frac{x_{g}}{y_{g}}L_{g}^{\prime}} + {\frac{x_{b}}{y_{b}}L_{b}^{\prime}}}} \\ {{\frac{1 - x_{t} - y_{t}}{y_{t}}\left( {L_{r}^{\prime} + L_{g}^{\prime} + L_{b}^{\prime}} \right)} = {{\frac{1 - x_{r} - y_{r}}{y_{r}}L_{r}^{\prime}} + {\frac{1 - x_{g} - y_{g}}{y_{g}}L_{g}^{\prime}} +}} \\ {\frac{1 - x_{b} - y_{b}}{y_{b}}L_{b}^{\prime}} \end{matrix} \right.$ where L_(r), L_(g), and L_(b) are respectively the maximum brightness values of the three primary colors of the colored light, and s.t. represents a constraint condition for the colored light with three primary colors.
 6. The color regulation method for automatically implementing the maximum brightness of a colored light according to claim 3, wherein the color mixture control step of converting the brightness formula values for each primary color into a control signal of a control console of the colored light comprises: dividing the brightness of the controlled colored light into N brightness levels from dark to bright, and converting the brightness formula values for each primary color into signal data of the control console of the colored light according to the following formula: ${{{signal}{data}} = {\frac{{brightness}{formula}{values}{for}{various}{primary}{colors}}{{maximum}{brightness}{values}{of}{the}{various}{primary}{colors}} \times N}},$ and converting the signal data into a control signal based on brightness level M of the controlled colored light according to the following formula, where O≤M≤N: ${{control}{signal}} = {{signal}{data} \times {\frac{M}{N}.}}$
 7. A color regulation system for automatically implementing the maximum brightness of a colored light, comprising: a color matching calculation unit, which is configured to collect brightness values and color coordinate values of each primary color of the colored light; establish a linear programming model according to a target color mixture K_(t), and the brightness values and the color coordinate values of each primary color of the colored light; and take a maximum value of a brightness sum value L_(sum) of the primary colors of the colored light as a target function to solve the linear programming model to obtain brightness values for each primary color under the maximum value of the brightness sum value L_(sum), the obtained brightness values for each primary color refer to as brightness formula values for each primary color, the brightness sum value L_(sum) is a sum of the brightness values of each primary color, wherein when the colored light has m primary colors, the color coordinate values of the target color mixture K_(t) of the colored light are denoted as (x_(t), y_(t)), the brightness values of the m primary colors of the colored light are respectively denoted as L′₁, L′₂, . . . , L_(m), and the color coordinate values of the m primary colors of the colored light are respectively denoted as (x₁, y₁), (x₂, y₂), . . . , and (x_(m), y_(m)); the linear programming model is the following formula: the target function is max L _(sum) =L′ ₁ +L′ ₂ +. . . +L′ _(m), $s.t.\left\{ \begin{matrix} {0 \leq L_{1}^{\prime} \leq L_{1}} \\ {0 \leq L_{2}^{\prime} \leq L_{2}} \\ {\ldots\ldots} \\ {0 \leq L_{m}^{\prime} \leq L_{m}} \\ {{\frac{x_{t}}{y_{t}}\left( {L_{1}^{\prime} + L_{2}^{\prime} + \ldots + L_{m}^{\prime}} \right)} = {{\frac{x_{1}}{y_{1}}L_{1}^{\prime}} + {\frac{x_{2}}{y_{2}}L_{2}^{\prime}} + \ldots + {\frac{x_{m}}{y_{m}}L_{m}^{\prime}}}} \\ \begin{matrix} {{\frac{1 - x_{t} - y_{t}}{y_{t}}\left( {L_{1}^{\prime} + L_{2}^{\prime} + \ldots + L_{m}^{\prime}} \right)} =} \\ {{\frac{1 - x_{1} - y_{1}}{y_{1}}L_{1}^{\prime}} + {\frac{1 - x_{2} - y_{2}}{y_{2}}L_{2}^{\prime}} + \ldots + {\frac{1 - x_{m} - y_{m}}{y_{m}}L_{m}^{\prime}}} \end{matrix} \end{matrix} \right.$ where m is an integer equal to or greater than 2, L_(r), L_(g), L_(b), and L_(w), are respectively the maximum brightness values of the m primary colors of the colored light, s.t. represents a constraint condition for the color light with m primary colors, a signal conversion unit, which is configured to convert the brightness formula values for each primary color into a control signal; and a drive unit, which is configured to control a color mixture of the colored light according to the control signal.
 8. The color regulation system for automatically implementing the maximum brightness of a colored light according to claim 7, wherein the color matching calculation unit is configured to: respectively calculate, according to specified n target color mixtures K_(t) and the brightness values and the color coordinate values of each primary color of the colored light, n groups of brightness formula values for each primary color, when the brightness sum value L_(sum) of the colored light has the maximum value in each case of the n target color mixtures K_(t), where n is a natural number; the system further comprises: a color matching regulation channel, which is configured to input a color index value i, where i=1, 2, . . . , and n; and a control unit, which is configured to pre-store the n groups of brightness formula values for each primary color, acquire the color index value i, and select the pre-stored i^(th) group of brightness formula values for the various primary colors; and the signal conversion unit is specifically configured to: convert the i^(th) group of brightness formula values for each primary color into the control signal.
 9. The color regulation system for automatically implementing the maximum brightness of a colored light according to claim 7, when the colored light has four primary colors, the color coordinates values of the target color mixture K_(t) of the colored light are denoted as (x_(t), y_(t)), the brightness values of the four primary colors of the colored light are respectively denoted as L′_(r), L′_(g), L′_(b), and L′_(w), and the color coordinate values of the four primary colors of the colored light are respectively denoted as (x_(r), y_(r)), (x_(g), y_(g)), (x_(b), y_(b)), and (x_(w), y_(w)); the linear programming model is the following formula: the target function is max L _(sum) =L′ _(r) +L′ _(g) +L′ _(b) +L′ _(w), $s.t.\left\{ \begin{matrix} {0 \leq L_{r}^{\prime} \leq L_{r}} \\ {0 \leq L_{g}^{\prime} \leq L_{g}} \\ {0 \leq L_{b}^{\prime} \leq L_{b}} \\ {0 \leq L_{w}^{\prime} \leq L_{w}} \\ {{\frac{x_{t}}{y_{t}}\left( {L_{r}^{\prime} + L_{g}^{\prime} + L_{b}^{\prime} + L_{w}^{\prime}} \right)} = {{\frac{x_{r}}{y_{r}}L_{r}^{\prime}} + {\frac{x_{g}}{y_{g}}L_{g}^{\prime}} + {\frac{x_{b}}{y_{b}}L_{b}^{\prime}} + {\frac{x_{w}}{y_{w}}L_{w}^{\prime}}}} \\ {{\frac{1 - x_{t} - y_{t}}{y_{t}}\left( {L_{r}^{\prime} + L_{g}^{\prime} + L_{b}^{\prime} + L_{w}^{\prime}} \right)} = {{\frac{1 - x_{r} - y_{r}}{y_{r}}L_{r}^{\prime}} + {\frac{1 - x_{g} - y_{g}}{y_{g}}L_{g}^{\prime}} +}} \\ {{\frac{1 - x_{b} - y_{b}}{y_{b}}L_{b}^{\prime}} + {\frac{1 - x_{w} - y_{w}}{y_{w}}L_{w}^{\prime}}} \end{matrix} \right.$ where L_(r), L_(g), L_(b), and L_(w) are respectively the maximum brightness values of the four primary colors of the colored light, and s.t. represents a constraint condition for the colored light with four primary colors; and when the colored light has three primary colors, the color coordinates values of the target color mixture K_(t) of the colored light are denoted as (x_(t), y_(t)), the brightness values of the three primary colors of the colored light are respectively denoted as L′_(r), L′_(g), and L′_(b), and the color coordinates values of the three primary colors of the colored light are respectively denoted as (x_(r), y_(r)), (x_(g), y_(g)), and (x_(b), y_(b)); the linear programming model is the following formula: the target function is max L _(sum) =L′ _(r) +L′ _(g) +L′ _(b), $s.t.\left\{ \begin{matrix} {0 \leq L_{r}^{\prime} \leq L_{r}} \\ {0 \leq L_{g}^{\prime} \leq L_{g}} \\ {0 \leq L_{b}^{\prime} \leq L_{b}} \\ {{\frac{x_{t}}{y_{t}}\left( {L_{r}^{\prime} + L_{g}^{\prime} + L_{b}^{\prime}} \right)} = {{\frac{x_{r}}{y_{r}}L_{r}^{\prime}} + {\frac{x_{g}}{y_{g}}L_{g}^{\prime}} + {\frac{x_{b}}{y_{b}}L_{b}^{\prime}}}} \\ {{\frac{1 - x_{t} - y_{t}}{y_{t}}\left( {L_{r}^{\prime} + L_{g}^{\prime} + L_{b}^{\prime}} \right)} = {{\frac{1 - x_{r} - y_{r}}{y_{r}}L_{r}^{\prime}} + {\frac{1 - x_{g} - y_{g}}{y_{g}}L_{g}^{\prime}} +}} \\ {\frac{1 - x_{b} - y_{b}}{y_{b}}L_{b}^{\prime}} \end{matrix} \right.$ where L_(r), L_(g), and L_(b) are respectively the maximum brightness values of the three primary colors of the colored light, and s.t. represents a constraint condition for the colored light with three primary colors.
 10. The color regulation system for automatically implementing the maximum brightness of a colored light according to claim 7, further comprising: a brightness regulation channel, which is configured to input a brightness level M of the controlled colored light, wherein the signal conversion unit is configured to: divide brightness of the controlled colored light into N levels from dark to bright, and convert the brightness formula values for each primary color into signal data of a control console of the colored light according to the following formula: ${{{signal}{data}} = {\frac{{brightness}{formula}{values}{for}{various}{primary}{colors}}{{maximum}{brightness}{values}{of}{the}{various}{primary}{colors}} \times N}},$ and convert the signal data into a control signal based on the brightness level M of the controlled colored light according to the following formula, where O≤M≤N: ${{control}{signal}} = {{signal}{data} \times {\frac{M}{N}.}}$ 